Minimal controllability problems on linear structural descriptor systems

We consider minimal controllability problems (MCPs) on linear structural descriptor systems. address two of determining the minimum number input nodes such that a system is structurally controllable. show MCP0 for systems can be solved in polynomial time. This same as existing results typical time invariant (LTI) However, derivation result considerably different because technique cannot used Instead, we use Dulmage--Mendelsohn decomposition. Moreover, prove MCP1 are from those usual LTI In fact, an NP-hard problem, while